A Fast Algorithm for the Eigenvalue Bounds of a Class of Symmetric Tridiagonal Interval Matrices
نویسندگان
چکیده
The eigenvalue bounds of interval matrices are often required in some mechanical and engineering fields. In this paper, we improve the theoretical results presented a previous paper “A property for class symmetric tridiagonal matrices” provide fast algorithm to find upper lower eigenvalues matrices.
منابع مشابه
Analysis of Eigenvalue Bounds for Real Symmetric Interval Matrices
In this paper, we present several verifiable conditions for eigenvalue intervals of real symmetric interval matrices overlapping or not overlapping. To above cases, two new methods with algorithms for computing eigenvalue bounds of real symmetric matrices are developed. We can estimate eigenvalue bounds moving away the assumption that two intervals containing two eigenvalues of real symmetric i...
متن کاملA Scalable Eigenvalue Solver for Symmetric Tridiagonal Matrices
This paper describes a parallel eigenvalue solver for symmetric tridiagonal matrices, as implemented on an nCUBE-2 hypercube multicomputer. The algorithm is based on the split-merge technique, which uses Laguerre's iteration and exploits the separation property in order to create subtasks that can be solved independently. Performance of an initial parallel implementation of the algorithm was ne...
متن کاملBounds for the extremal eigenvalues of a class of symmetric tridiagonal matrices with applications
We consider a class of symmetric tridiagonal matrices which may be viewed as perturbations of Toeplitz matrices. The Toeplitz structure is destroyed since two elements on each off-diagonal are perturbed. Based on a careful analysis of the corresponding characteristic polynomial, we derive sharp bounds for the extremal eigenvalues of this class of matrices in terms of the original data of the gi...
متن کاملEigenvalues of symmetric tridiagonal interval matrices revisited
In this short note, we present a novel method for computing exact lower and upper bounds of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and avoids any assumptions Our construction explicitly yields those matrices for which particular lower and upper bounds are attained.
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AppliedMath
سال: 2023
ISSN: ['2673-9909']
DOI: https://doi.org/10.3390/appliedmath3010007